Synthesis of Elementary Net Systems with Final Configurations

In this paper, we extend the definition of transition systems, as well as the definition of elementary net systems, by a notion of final states and provide a solution to the synthesis problem of elementary net systems with final configurations. Furthermore, we present how to simplify complex sets of final configurations of an elementary net system by introducing the notion of neat places. A place is neat if it is marked only if the elementary net system is in a final configuration. If it is not possible to generate a neat place, we present a heuristic to identify so-called neat terms indicating final configurations.